A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

基于循环子空间理论的线性系统测试矩阵优化

研究了线性定常系统在循环指数大于1(即其约当标准形不同的约当块有重根)的情况下测试矩阵的优化方法.以循环子空间相关定理的证明为基础,根据根向量链的相关特性,得到了测试向量的线性和与系统观测性的直接关系,给出了在保证系统可观测性的同时,使得测试代价最小的测试矩阵优化方法.算例表明,提出的方法简单直观,对配置测试向量具有良好的工程价值.     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.     

基于模糊动态层次分析法的军车全寿命费用模型

为研究军车最优的效费比，提出了控制军车装备费用增长的有效途径——全寿命费用管理方法，并通过模糊动态层次分析法建立了分析决策模型，将定性与定量的分析有机结合起来研究军车全寿命费用的变化趋势，有利于提高军车装备的可靠性和决策的科学性，具有较好的应用价值。     

最小费用树

本文在赋边权w和顶点权θ的网络中,建立了最小费用树问题的网络模型。文中对问题的复杂性进行了讨论并给出了求解问题的算法     

一种无人战斗机系统使用保障费用分析方法

基于无人战斗机系统在使用保障上的特点,通过对有人战斗机使用保障费用模型进行合理改造,使其能适用于无人战斗机的使用保障费用分析。经过改造的模型具有结构清晰、概念明确的特点。适合在飞机总体设计阶段用于全寿命周期的费用估算以及飞机的费效分析和综合优化设计。通过与有人战斗机的使用保障费用进行对比计算表明,无人战斗机系统的使用保障费用具有明显的经济优势。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

试论武器装备的效费比分析

运用价值工程(VE)方法分析武器装备,称效费比为价值。按照杜佩(Dupuy)的方法,把武器装备的效能转化为“战斗效能值”(OLI),又计算出了武器装备的全寿命费用,然后将2者加以对比,获得效能—费用的最佳组合,同时提出了选择武器装备系统的定量分析方法。这些对于提高我国国防经济效益,具有一定的指导和借鉴意义。     

舰船可靠性对维修费用的影响分析

对两类主要影响因素分别建立了相应的数学模型．依据约化理论,建立了维修费用的ＶＡＲ模型．同时,根据统计资料分析了实际舰载主要设备的故障规律,指出了传统定时维修方式的理论基础的不完整性．